Computing the binding number of a graph

Uniform Number of a Graph

We introduce the notion of uniform number of a graph. The  uniform number of a connected graph $G$ is the least cardinality of a nonempty subset $M$ of the vertex set of $G$ for which the function $f_M: M^crightarrow mathcal{P}(X) - {emptyset}$ defined as $f_M(x) = {D(x, y): y in M}$ is a constant function, where $D(x, y)$ is the detour distance between $x$ and $y$ in $G$ and $mathcal{P}(X)$ ...

The convex domination subdivision number of a graph

Let $G=(V,E)$ be a simple graph. A set $Dsubseteq V$ is adominating set of $G$ if every vertex in $Vsetminus D$ has atleast one neighbor in $D$. The distance $d_G(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$G$. An $(u,v)$-path of length $d_G(u,v)$ is called an$(u,v)$-geodesic. A set $Xsubseteq V$ is convex in $G$ ifvertices from all $(a, b)$-geodesics belon...

The relationship between the distinguishing number and the distinguishing index with detection number of a graph

This article has no abstract.

The binding number of a random graph

Let G be a random graph with n labelled vertices in which the edges are chosen independently with a fixed probability p, 0 < p < 1. In this note we prove that, with the probability tending to 1 as n -+ 00, the binding number of a random graph G satisfies: (i) b(G) = (n l)/(n 8), where 8 is the minimal degree of G; (ii) l/q E < b(G) < l/q, where E is any fixed positive number and q = 1 p; (iii) ...

The Maximum Number of Edges in a Strongly Multiplicative Graph